The Slepian-Wolf Theorem

"Real" Slepian-Wolf codes

We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...

Analysis of Slepian Wolf Coding

A Generalized Quantum Slepian-Wolf

In this work we consider a quantum generalization of the task considered by Slepian andWolf [1] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and prov...

Universal Incremental Slepian-Wolf Coding

We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an incremental transmission policy, and the decoder a universal sequential decision test. We show that the decoder is able to decode shortly after the rates of transmission exceed the Slepian-Wolf bounds. The decoder then send an ACK back to the encoders, terminating transmissio...

On the redundancy of Slepian--Wolf coding

In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of  with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...